Transient Analysis of a Discrete-time Priority Queue
نویسندگان
چکیده
In this paper, we present a transient analysis of the system contents in a two-class priority queue with single-slot service times. In particular, we derive an expression for the generating function of the transient system contents of both classes. Performance measures are calculated from this generating function. Finally, by means of a numerical example we investigate the impact of the traffic parameters on the transient performance measures.
منابع مشابه
Time-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...
متن کاملANALYSIS OF A DISCRETE-TIME IMPATIENT CUSTOMER QUEUE WITH BERNOULLI-SCHEDULE VACATION INTERRUPTION
This paper investigates a discrete-time impatient customer queue with Bernoulli-schedule vacation interruption. The vacation times and the service times during regular busy period and during working vacation period are assumed to follow geometric distribution. We obtain the steady-state probabilities at arbitrary and outside observer's observation epochs using recursive technique. Cost analysi...
متن کاملOn the Transient and Steady-State Analysis of a Special Single Server Queuing System with HOL Priority Scheduling
In this paper, we consider a special discrete-time queuing system with two head-of-line (HOL) priority queues and a mix of correlated and uncorrelated arrivals. The arrival process to the high priority queue is correlated and consists of a train of a fixed number of fixed-length packets, while the low priority traffic consists of batch arrivals that are independent and identically distributed f...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کامل